1359C - Mixing Water - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long int
#define forl(n) for (int i = 0; i < n; i++)
#define fora(i, a, b) for (int i = a; i < b; i++)
using namespace std;

void parray(ll a[], ll n)
{
	for (int i = 0; i < n; i++)
	{
		cout << a[i] << " ";
	}
	cout << endl;
}

ll prime(int n)
{
	int i;
	for (i = 2; i <= sqrt(n); i++)
	{
		if (n % i != 0)
			continue;
		else
			return 1;
	}
	return 0;
}

ll maxsubarray(int a[], int n)
{
	ll max_so_far = LONG_MIN, max = 0;

	for (int i = 0; i < n; i++)
	{
		max = max + a[i];
		if (max_so_far < max)
			max_so_far = max;

		if (max < 0)
			max = 0;
	}
	return max_so_far;
}

bool compare(vector<int> &a,vector<int> &b)
{
	return a.size()>b.size();
}

ll getSum(ll n)
{
	ll sum = 0;
	while (n != 0) {
		sum = sum + n % 10;
		n = n / 10;
	}
	return sum;
}

int main()
{


	int t1;
	cin >> t1;

	while (t1--)
	{
		// cout<<"TEST:"<<t<<endl;
		long double h,c,t;
		cin>>h>>c>>t;

		long double temp=(h+c)/2;
		
			long double i;
			i=(t-c)/(2*t-h-c);
			ll i1=((ll)i);
			if(i1<=0){
				cout<<2<<endl;
				continue;
			}
			long double ans1=abs(t-((h*i1+c*(i1-1))/(2*i1-1)));
			long double ans2=abs(t-((h*(i1+1)+c*(i1))/(2*i1+1)));
			long double mini=min(ans1,ans2);
			if(mini==ans1)
			{
				cout<<2*i1-1<<endl;
			}
			else
			{
				cout<<2*i1+1<<endl;
			}

	}
}